-
1 multiple recursion
Большой англо-русский и русско-английский словарь > multiple recursion
-
2 multiple recursion
Математика: многократная рекурсия -
3 multiple recursion
-
4 multiple recursion
The New English-Russian Dictionary of Radio-electronics > multiple recursion
-
5 multiple recursion
-
6 recursion
рекурсия; циклическое повторение -
7 recursion
вчт1) рекурсия2) рекуррентная формула; рекуррентное соотношение•- double recursion
- limited recursion
- multiple recursion
- nested recursion
- primitive recursion
- restricted recursion
- shifted recursion
- structural recursion
- tail recursion
- transfinite recursion
- unnested recursion -
8 recursion
вчт.1) рекурсия2) рекуррентная формула; рекуррентное соотношение•- double recursion
- limited recursion
- multiple recursion
- nested recursion
- primitive recursion
- restricted recursion
- shifted recursion
- structural recursion
- tail recursion
- transfinite recursion
- unnested recursionThe New English-Russian Dictionary of Radio-electronics > recursion
-
9 многократная рекурсия
Большой англо-русский и русско-английский словарь > многократная рекурсия
-
10 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
11 relationship
-
12 scheme
1) схема || составлять схему2) план; замысел || планировать, замышлять•- composite sampling scheme - decisive scheme - double sampling scheme - singly connected scheme
См. также в других словарях:
Recursion (novel) — Recursion (2004) is Tony Ballantyne s first novel. It is in the science fiction genre and follows three separate characters and their stories in a futuristic dystopia.Of high import to the storyline is the concept of the Singularity, a point in… … Wikipedia
Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Lisp (programming language) — Infobox programming language name = Lisp paradigm = multi paradigm: functional, procedural, reflective generation = 3GL year = 1958 designer = John McCarthy developer = Steve Russell, Timothy P. Hart, and Mike Levin latest release version =… … Wikipedia
Common Lisp — Paradigm(s) Multi paradigm: procedural, functional, object oriented, meta, reflective, generic Appeared in 1984, 1994 for ANSI Common Lisp Developer ANSI X3J13 committee Typing discipline … Wikipedia
Logic — For other uses, see Logic (disambiguation). Philosophy … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Subroutine — In computer science, a subroutine (function, method, procedure, or subprogram) is a portion of code within a larger program, which performs a specific task and can be relatively independent of the remaining code. The syntax of many programming… … Wikipedia
C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new … Wikipedia
